Automata over a Binary Alphabet Generating Free Groups of Even Rank
نویسندگان
چکیده
We construct automata over a binary alphabet with 2n states, n ≥ 2, whose states freely generate a free group of rank 2n. Combined with previous work, this shows that a free group of every finite rank can be generated by finite automata over a binary alphabet. We also construct free products of cyclic groups of order two via such automata.
منابع مشابه
Representations of a Free Group of Rank Two by Time-varying Mealy Automata
In the group theory various representations of free groups are used. A representation of a free group of rank two by the so-called time-varying Mealy automata over the changing alphabet is given. Two different constructions of such automata are presented.
متن کاملIterating Inverse Binary Transducers
We study iterated transductions defined by a class of inverse transducers over the binary alphabet. The transduction semigroups of these automata turn out to be free Abelian groups and the orbits of finite words can be described as affine subspaces in a suitable geometry defined by the generators of these groups. We show that iterated transductions are rational for a subclass of our automata.
متن کاملMeasuring cones and other thick subsets in free groups
In this paper we investigate the special automata over finite rank free groups and estimate asymptotic characteristics of sets they accept. We show how one can decompose an arbitrary regular subset of a finite rank free group into disjoint union of sets accepted by special automata or special monoids. These automata allow us to compute explicitly generating functions, λ−measures and Cesaro meas...
متن کاملGenerating All Minimal Petri Net Unsolvable Binary Words
Sets of finite words, as well as some infinite ones, can be described using finite systems, e.g. automata. On the other hand, some automata may be constructed with use of even more compact systems, like Petri nets. We call such automata Petri net solvable. In this paper we consider the solvability of singleton languages over a binary alphabet (i.e. binary words). An unsolvable (i.e. not solvabl...
متن کاملIterating Invertible Binary Transducers
We study iterated transductions defined by a class of invertible transducers over the binary alphabet. The transduction semigroups of these automata turn out to be free Abelian groups and the orbits of finite words can be described as affine subspaces in a suitable geometry defined by the generators of these groups. We show that iterated transductions are rational for a subclass of our automata.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IJAC
دوره 21 شماره
صفحات -
تاریخ انتشار 2011